Very fast parallel algorithms for approximate edge coloring
نویسندگان
چکیده
منابع مشابه
Very fast parallel algorithms for approximate edge coloring
This paper presents very fast parallel algorithms for approximate edge coloring. Let log n= log n; log n = log(log(k−1) n), and log∗(n) = min{k | log n¡ 1}. It is shown that a graph with n vertices and m edges can be edge colored with (2dlog1=4 log∗(n)e)c · (d =log log∗(n)e)2 colors in O(log log∗(n)) time using O(m+ n) processors on the EREW PRAM, where is the maximum vertex degree of the graph...
متن کاملAnalysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs
The problem of edge coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors An optimal algorithm uses the minimum number of colors to color the edges We consider several approximation algorithms for edge coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case We also present results on the constrained edge colori...
متن کاملParallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
with D 1 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires D or D 1 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that x9(G) # 3D/2 [16]. A number of parallel algorithms exist for the edge-coloring problem. Lev et al. [14] presented parallel edge-coloring algorithms with D colors for bipartite multigraphs. When D 5 2, the...
متن کاملApproximate Constrained Bipartite Edge Coloring
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملEdge-coloring series-parallel multigraphs
We give a simpler proof of Seymour’s Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00190-0